public class test {
    public int[] searchRange(int[] nums,int target){
        int[] ret = new int[2];
        ret[0] = ret[1] = -1;
        int left = 0,right = nums.length-1;
        if (nums.length == 0) return ret;
        while (left < right){
            //左端点
            int mid = left + (right - left) / 2;
            if (nums[mid] >= target) right = mid;
            else left = mid + 1;
        }
        if (nums[right] != target) return ret;
        else ret[0] = right;

        //右端点
        left = 0;
        right = nums.length - 1;
        while (left < right){
            int mid = left + (right - left) / 2 + 1;
            if (nums[mid] > target) right = mid - 1;
            else left = mid;
        }
        ret[1] = left;
        return ret;
    }
}
